منابع مشابه
the problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولThe case of equality in Landau's problem
While investigating summability methods for infinite series [5], Hardy and Littlewood posed an interesting problem which Kolmogorov solved 28 years later and that is the topic for this paper. Write f = O(g) if and only if limx→∞ f (x)/g(x) <∞. Hardy and Littlewood showed that if f is twice continuously differentiable for x > xo and if f = O(1) and f ′′ = O(1), then f ′ =O(1). More generally, th...
متن کاملMatrix representation of a sixth order Sturm-Liouville problem and related inverse problem with finite spectrum
In this paper, we find matrix representation of a class of sixth order Sturm-Liouville problem (SLP) with separated, self-adjoint boundary conditions and we show that such SLP have finite spectrum. Also for a given matrix eigenvalue problem $HX=lambda VX$, where $H$ is a block tridiagonal matrix and $V$ is a block diagonal matrix, we find a sixth order boundary value problem of Atkin...
متن کاملEquality of Streams is a Π2-Complete Problem
This paper gives a precise characterization for the complexity of the problem of proving equal two streams defined with a finite number of equations: Π2. Since the Π2 class includes properly both the recursively enumerable and the co-recursively enumerable classes, this result implies that one can find no mechanical procedure to say when two streams are equal, as well as no procedure to say whe...
متن کاملEquality of Streams is a Π 02 - Complete Problem ∗
This paper gives a precise characterization for the complexity of the problem of proving equal two streams defined with a finite number of equations: Π2. Since the Π 0 2 class includes properly both the recursively enumerable and the co-recursively enumerable classes, this result implies that neither the set of pairs of equal streams nor the set of pairs of unequal streams is recursively enumer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rendiconti del Circolo Matematico di Palermo Series 2
سال: 2018
ISSN: 0009-725X,1973-4409
DOI: 10.1007/s12215-018-0346-x